Converging on program simplicity

Converging on Program Simplicity

Simplicity: A Key Engineering Concept for Program Understanding

One of the most significant problems for existing program comprehension methods is its scalability. In this paper, we introduce a new technique to make the scalability possible. In particular, we advocate the concept of “simplicity” for program understanding. We first propose a simplifed semantic network as domain knowledge representation; we then introduce a linear and domain-oriented program ...

A remark on the converging-input converging-state property

Suppose that an equilibrium is asymptotically stable when external inputs vanish. Then, every bounded trajectory which corresponds to a control which approaches zero and which lies in the domain of attraction of the unforced system, must also converge to the equilibrium. This “well-known” but hard-to-cite fact is proved and slightly generalized here.

On simplicity of vacuum modules

We find necessary and sufficient conditions of irreducibility of vacuum modules over affine Lie algebras and superalgebras. From this we derive conditions of simplicity of minimal W -algebras. Moreover, in the case of the Virasoro and Neveu–Schwarz algebras we obtain explicit formulas for the vacuum determinants. © 2006 Elsevier Inc. All rights reserved.

Converging Hands or Converging Minds?

Interlocutors sometimes repeat each other’s representational hand gestures. We investigated if this is a case of direct mimicry of form, or whether perceiving a gesture gives rise to a semantic representation, which subsequently informs gesture production. For this we used an interactive route description task, in which a confederate’s gestures indicated the route in either the vertical or the ...